Combinatorial Programs and Efficient Property Testers ∗
نویسندگان
چکیده
Combinatorial Programs and Efficient Property Testers ∗ Artur Czumaj Department of Computer Science New Jersey Institute of Technology University Heights Newark, NJ 07102-1982, USA E-mail: [email protected] Christian Sohler Heinz Nixdorf Institute and Department of Mathematics & Computer Science University of Paderborn D-33095 Paderborn, Germany E-mail: [email protected]
منابع مشابه
Abstract combinatorial programs and efficient property testers - Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE Symposium on
Combinatorial Programs and Efficient Property Testers Artur Czumaj Department of Computer Science New Jersey Institute of Technology University Heights Newark, NJ 07102-1982, USA E-mail: [email protected] Christian Sohler Heinz Nixdorf Institute and Department of Mathematics & Computer Science University of Paderborn D-33095 Paderborn, Germany E-mail: [email protected]
متن کاملAbstract Combinatorial Programs and Efficient Property Testers
COMBINATORIAL PROGRAMS AND EFFICIENT PROPERTY TESTERS∗ ARTUR CZUMAJ† AND CHRISTIAN SOHLER‡ Abstract. Property testing is a relaxation of classical decision problems which aims at distinguishing between functions having a predetermined property and functions being far from any function having the property. In this paper we present a novel framework for analyzing property testing algorithms. Our ...
متن کاملHomomorphisms in Graph Property Testing - A Survey
Property-testers are fast randomized algorithms for distinguishing between graphs (and other combinatorial structures) satisfying a certain property, from those that are far from satisfying it. In many cases one can design property-testers whose running time is in fact independent of the size of the input. In this paper we survey some recent results on testing graph properties. A common thread ...
متن کاملReducing the Randomness Complexity of Property Testing, with an Emphasis on Testing Bipartiteness
Property testers are algorithms whose goal is distinguishing between inputs that have a certain property and inputs which are far from all instances with this property. We show that for a wide variety of properties, there exists no deterministic tester that queries only a sublinear number of input entries. Therefore, most sublinear property testers must be probabilistic algorithms. Nevertheless...
متن کاملQuantum Testers for Hidden Group Properties
We construct efficient or query efficient quantum property testers for two existential group properties which have exponential query complexity both for their decision problem in the quantum and for their testing problem in the classical model of computing. These are periodicity in groups and the common coset range property of two functions having identical ranges within each coset of some norm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002